Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
نویسندگان
چکیده
منابع مشابه
Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
Given positive integers a ≤ b ≤ c, let Ka,b,c be the complete 3-partite 3-uniform hypergraph with three parts of sizes a, b, c. Let H be a 3-uniform hypergraph on n vertices where n is divisible by a + b + c. We asymptotically determine the minimum vertex degree of H that guarantees a perfect Ka,b,ctiling, that is, a spanning subgraph of H consisting of vertex-disjoint copies of Ka,b,c. This pa...
متن کاملMinimum degree thresholds for bipartite graph tiling
Given a bipartite graph H and a positive integer n such that v(H) divides 2n, we define the minimum degree threshold for bipartite H-tiling, δ2(n,H), as the smallest integer k such that every bipartite graph G with n vertices in each partition and minimum degree δ(G) ≥ k contains a spanning subgraph consisting of vertex-disjoint copies of H. Zhao, Hladký-Schacht, Czygrinow-DeBiasio determined δ...
متن کاملMinimum degree condition for C4-tiling in 3-uniform hypergraphs
We show that there is n0 such that if H is a 3-uniform hypergraph on n ∈ 4Z, n ≥ n0, vertices such that δ1(H) ≥ ( n−1 2 ) − ( 3n/4 2 ) + 3n 8 + 1 2 , then H can be tiled with copies of C4, the unique 3-uniform hypergraph on four vertices with two edges. The degree condition is tight when 8|n.
متن کاملThe generalized connectivity of complete equipartition 3-partite graphs
Let G be a nontrivial connected graph of order n, and k an integer with 2 ≤ k ≤ n. For a set S of k vertices of G, let κ(S) denote the maximum number ` of edge-disjoint trees T1, T2, . . . , T` in G such that V (Ti) ∩ V (Tj) = S for every pair of distinct integers i, j with 1 ≤ i, j ≤ `. Chartrand et al. generalized the concept of connectivity as follows: The kconnectivity of G, denoted by κk(G...
متن کاملTiling Tripartite Graphs with 3-Colorable Graphs
For any positive real number γ and any positive integer h, there is N0 such that the following holds. Let N > N0 be such that N is divisible by h. If G is a tripartite graph with N vertices in each vertex class such that every vertex is adjacent to at least (2/3 + γ)N vertices in each of the other classes, then G can be tiled perfectly by copies of Kh,h,h. This extends the work in [Discrete Mat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2017
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2017.02.003